0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.17 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.17/0.38 % Computer : n016.cluster.edu 0.17/0.38 % Model : x86_64 x86_64 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.17/0.38 % Memory : 8042.1875MB 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64 0.17/0.38 % CPULimit : 1200 0.17/0.38 % WCLimit : 120 0.17/0.38 % DateTime : Tue Jul 13 10:41:53 EDT 2021 0.17/0.38 % CPUTime : 0.24/0.38 % Number of cores: 8 0.24/0.39 % Python version: Python 3.6.8 0.24/0.39 # Version: 2.6rc1-ho 0.24/0.40 # No SInE strategy applied 0.24/0.40 # Trying AutoSched0 for 59 seconds 3.37/3.59 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 3.37/3.59 # and selection function SelectMaxLComplexAvoidPosPred. 3.37/3.59 # 3.37/3.59 # Preprocessing time : 0.094 s 3.37/3.59 3.37/3.59 # Proof found! 3.37/3.59 # SZS status Theorem 3.37/3.59 # SZS output start CNFRefutation 3.37/3.59 thf(fact_275__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062, axiom, ~(![X34:node, X35:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ X35 @ X34=>(member_node @ X34 @ (set_node2 @ ms)=>(~(prefix_node @ X35 @ rs2)<=![X36:node]:(member_node @ X36 @ (set_node2 @ (butlast_node @ X35))=>~(member_node @ X36 @ (set_node2 @ ms))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_275__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062)). 3.37/3.59 thf(fact_17_old_Opath2__hd, axiom, ![X14:g, X15:node, X16:list_node, X17:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X15 @ X16 @ X17=>(X15)=(hd_node @ X16)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_old_Opath2__hd)). 3.37/3.59 thf(fact_88_Nil__is__append__conv, axiom, ![X2:list_node, X358:list_node]:((nil_node)=(append_node @ X2 @ X358)<=>((X358)=(nil_node)&(X2)=(nil_node))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_88_Nil__is__append__conv)). 3.37/3.59 thf(fact_190_list_Odistinct_I1_J, axiom, ![X38:node, X39:list_node]:(nil_node)!=(cons_node @ X38 @ X39), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_190_list_Odistinct_I1_J)). 3.37/3.59 thf(fact_273_hd__append, axiom, ![X2:list_node, X322:list_node]:(((X2)=(nil_node)=>(hd_node @ (append_node @ X2 @ X322))=(hd_node @ X322))&((X2)!=(nil_node)=>(hd_node @ (append_node @ X2 @ X322))=(hd_node @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_273_hd__append)). 3.37/3.59 thf(fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062, axiom, (ri)=(append_node @ tmp @ (cons_node @ i @ nil_node)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062)). 3.37/3.59 thf(fact_348_Sublist_Osuffix__def, axiom, (suffix_node)=(^[X193:list_node, X527:list_node]:?[X528:list_node]:(X527)=(append_node @ X528 @ X193)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_348_Sublist_Osuffix__def)). 3.37/3.59 thf(fact_5_rs_H__props_I1_J, axiom, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs @ pred_phi_r, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_rs_H__props_I1_J)). 3.37/3.59 thf(fact_7_rs_H__rest__prop, axiom, (rs)=(append_node @ ri @ rs_rest), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_7_rs_H__rest__prop)). 3.37/3.59 thf(fact_347_suffixI, axiom, ![X260:list_node, X261:list_node, X2:list_node]:(suffix_node @ X2 @ X260<=(X260)=(append_node @ X261 @ X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_347_suffixI)). 3.37/3.59 thf(fact_3_old_Opath2__split_I2_J, axiom, ![X14:g, X15:node, X16:list_node, X67:node, X71:list_node, X17:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X15 @ (append_node @ X16 @ (cons_node @ X67 @ X71)) @ X17=>graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X67 @ (cons_node @ X67 @ X71) @ X17), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_old_Opath2__split_I2_J)). 3.37/3.59 thf(conj_0, conjecture, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ (cons_node @ i @ rs_rest) @ pred_phi_r, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 3.37/3.59 thf(fact_1_rs_H__rest__def, axiom, (rs)=(append_node @ tmp @ (cons_node @ i @ rs_rest)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_rs_H__rest__def)). 3.37/3.59 thf(c_0_13, plain, ~(![X34:node, X35:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ X35 @ X34=>(member_node @ X34 @ (set_node2 @ ms)=>(![X36:node]:(member_node @ X36 @ (set_node2 @ (butlast_node @ X35))=>~member_node @ X36 @ (set_node2 @ ms))=>~prefix_node @ X35 @ rs2)))), inference(fof_simplification,[status(thm)],[fact_275__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062])). 3.37/3.59 thf(c_0_14, plain, ![X2423:g, X2424:node, X2425:list_node, X2426:node]:(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2423 @ X2424 @ X2425 @ X2426|(X2424)=(hd_node @ X2425)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_17_old_Opath2__hd])])). 3.37/3.59 thf(c_0_15, plain, ![X1715:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ esk15_0 @ esk14_0&(member_node @ esk14_0 @ (set_node2 @ ms)&((~member_node @ X1715 @ (set_node2 @ (butlast_node @ esk15_0))|~member_node @ X1715 @ (set_node2 @ ms))&prefix_node @ esk15_0 @ rs2))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])). 3.37/3.59 thf(c_0_16, plain, ![X2447:list_node, X2448:list_node]:((((X2448)=(nil_node)|(nil_node)!=(append_node @ X2447 @ X2448))&((X2447)=(nil_node)|(nil_node)!=(append_node @ X2447 @ X2448)))&((X2448)!=(nil_node)|(X2447)!=(nil_node)|(nil_node)=(append_node @ X2447 @ X2448))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_88_Nil__is__append__conv])])])). 3.37/3.59 thf(c_0_17, plain, ![X2054:node, X2055:list_node]:(nil_node)!=(cons_node @ X2054 @ X2055), inference(variable_rename,[status(thm)],[fact_190_list_Odistinct_I1_J])). 3.37/3.59 thf(c_0_18, plain, ![X14:g, X2:list_node, X1:node, X6:node]:((X1)=(hd_node @ X2)|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X1 @ X2 @ X6), inference(split_conjunct,[status(thm)],[c_0_14])). 3.37/3.59 thf(c_0_19, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ esk15_0 @ esk14_0, inference(split_conjunct,[status(thm)],[c_0_15])). 3.37/3.59 thf(c_0_20, plain, ![X2355:list_node, X2356:list_node]:(((X2355)!=(nil_node)|(hd_node @ (append_node @ X2355 @ X2356))=(hd_node @ X2356))&((X2355)=(nil_node)|(hd_node @ (append_node @ X2355 @ X2356))=(hd_node @ X2355))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_273_hd__append])])). 3.37/3.59 thf(c_0_21, plain, ![X3:list_node, X2:list_node]:((X2)=(nil_node)|(nil_node)!=(append_node @ X3 @ X2)), inference(split_conjunct,[status(thm)],[c_0_16])). 3.37/3.59 thf(c_0_22, plain, (ri)=(append_node @ tmp @ (cons_node @ i @ nil_node)), inference(split_conjunct,[status(thm)],[fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062])). 3.37/3.59 thf(c_0_23, plain, ![X1:node, X2:list_node]:(nil_node)!=(cons_node @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_17])). 3.37/3.59 thf(c_0_24, plain, ![X193:list_node, X527:list_node]:(suffix_node @ X193 @ X527<=>?[X1658:list_node]:(X527)=(append_node @ X1658 @ X193)), inference(fof_simplification,[status(thm)],[fact_348_Sublist_Osuffix__def])). 3.37/3.59 thf(c_0_25, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs @ pred_phi_r, inference(split_conjunct,[status(thm)],[fact_5_rs_H__props_I1_J])). 3.37/3.59 thf(c_0_26, plain, (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)=(hd_node @ esk15_0), inference(spm,[status(thm)],[c_0_18, c_0_19])). 3.37/3.59 thf(c_0_27, plain, ![X3:list_node, X2:list_node]:((X2)=(nil_node)|(hd_node @ (append_node @ X2 @ X3))=(hd_node @ X2)), inference(split_conjunct,[status(thm)],[c_0_20])). 3.37/3.59 thf(c_0_28, plain, (rs)=(append_node @ ri @ rs_rest), inference(split_conjunct,[status(thm)],[fact_7_rs_H__rest__prop])). 3.37/3.59 thf(c_0_29, plain, (ri)!=(nil_node), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])). 3.37/3.59 thf(c_0_30, plain, ![X260:list_node, X261:list_node, X2:list_node]:((X260)=(append_node @ X261 @ X2)=>suffix_node @ X2 @ X260), inference(fof_simplification,[status(thm)],[fact_347_suffixI])). 3.37/3.59 thf(c_0_31, plain, ![X2011:g, X2012:node, X2013:list_node, X2014:node, X2015:list_node, X2016:node]:(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2011 @ X2012 @ (append_node @ X2013 @ (cons_node @ X2014 @ X2015)) @ X2016|graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2011 @ X2014 @ (cons_node @ X2014 @ X2015) @ X2016), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_old_Opath2__split_I2_J])])). 3.37/3.59 thf(c_0_32, plain, ![X2892:list_node, X2893:list_node, X2895:list_node, X2896:list_node, X2897:list_node]:((~suffix_node @ X2892 @ X2893|(X2893)=(append_node @ (esk291_2 @ X2892 @ X2893) @ X2892))&((X2896)!=(append_node @ X2897 @ X2895)|suffix_node @ X2895 @ X2896)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])). 3.37/3.59 thf(c_0_33, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ esk15_0) @ rs @ pred_phi_r, inference(rw,[status(thm)],[c_0_25, c_0_26])). 3.37/3.59 thf(c_0_34, plain, (hd_node @ rs)=(hd_node @ ri), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])). 3.37/3.59 thf(c_0_35, plain, ![X2223:list_node, X2224:list_node, X2225:list_node]:((X2223)!=(append_node @ X2224 @ X2225)|suffix_node @ X2225 @ X2223), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])). 3.37/3.59 thf(c_0_36, plain, ![X6:node, X2:list_node, X1:node, X3:list_node, X14:g, X7:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X6 @ (cons_node @ X6 @ X3) @ X7|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X1 @ (append_node @ X2 @ (cons_node @ X6 @ X3)) @ X7), inference(split_conjunct,[status(thm)],[c_0_31])). 3.37/3.59 thf(c_0_37, plain, ![X2:list_node, X3:list_node]:((X3)=(append_node @ (esk291_2 @ X2 @ X3) @ X2)|~suffix_node @ X2 @ X3), inference(split_conjunct,[status(thm)],[c_0_32])). 3.37/3.59 thf(c_0_38, plain, (hd_node @ esk15_0)=(hd_node @ ri), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_33]), c_0_34])). 3.37/3.59 thf(c_0_39, plain, ![X2:list_node, X3:list_node, X4:list_node]:(suffix_node @ X4 @ X2|(X2)!=(append_node @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_35])). 3.37/3.59 thf(c_0_40, negated_conjecture, ~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ (cons_node @ i @ rs_rest) @ pred_phi_r, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 3.37/3.59 thf(c_0_41, plain, ![X6:node, X1:node, X2:list_node, X14:g, X7:node, X3:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X1 @ (cons_node @ X1 @ X2) @ X6|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X14 @ X7 @ X3 @ X6|~suffix_node @ (cons_node @ X1 @ X2) @ X3), inference(spm,[status(thm)],[c_0_36, c_0_37])). 3.37/3.59 thf(c_0_42, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ ri) @ rs @ pred_phi_r, inference(rw,[status(thm)],[c_0_33, c_0_38])). 3.37/3.59 thf(c_0_43, plain, ![X3:list_node, X2:list_node]:suffix_node @ X2 @ (append_node @ X3 @ X2), inference(er,[status(thm)],[c_0_39])). 3.37/3.59 thf(c_0_44, plain, (rs)=(append_node @ tmp @ (cons_node @ i @ rs_rest)), inference(split_conjunct,[status(thm)],[fact_1_rs_H__rest__def])). 3.37/3.59 thf(c_0_45, negated_conjecture, ~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ (cons_node @ i @ rs_rest) @ pred_phi_r, inference(split_conjunct,[status(thm)],[c_0_40])). 3.37/3.59 thf(c_0_46, plain, ![X1:node, X2:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X1 @ (cons_node @ X1 @ X2) @ pred_phi_r|~suffix_node @ (cons_node @ X1 @ X2) @ rs), inference(spm,[status(thm)],[c_0_41, c_0_42])). 3.37/3.59 thf(c_0_47, plain, suffix_node @ (cons_node @ i @ rs_rest) @ rs, inference(spm,[status(thm)],[c_0_43, c_0_44])). 3.37/3.59 thf(c_0_48, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47])]), ['proof']). 3.37/3.59 # SZS output end CNFRefutation 3.37/3.59 # Proof object total steps : 49 3.37/3.59 # Proof object clause steps : 24 3.37/3.59 # Proof object formula steps : 25 3.37/3.59 # Proof object conjectures : 4 3.37/3.59 # Proof object clause conjectures : 2 3.37/3.59 # Proof object formula conjectures : 2 3.37/3.59 # Proof object initial clauses used : 13 3.37/3.59 # Proof object initial formulas used : 13 3.37/3.59 # Proof object generating inferences : 9 3.37/3.59 # Proof object simplifying inferences : 7 3.37/3.59 # Training examples: 0 positive, 0 negative 3.37/3.59 # Parsed axioms : 423 3.37/3.59 # Removed by relevancy pruning/SinE : 0 3.37/3.59 # Initial clauses : 869 3.37/3.59 # Removed in clause preprocessing : 111 3.37/3.59 # Initial clauses in saturation : 758 3.37/3.59 # Processed clauses : 10129 3.37/3.59 # ...of these trivial : 197 3.37/3.59 # ...subsumed : 6342 3.37/3.59 # ...remaining for further processing : 3590 3.37/3.59 # Other redundant clauses eliminated : 6062 3.37/3.59 # Clauses deleted for lack of memory : 0 3.37/3.59 # Backward-subsumed : 124 3.37/3.59 # Backward-rewritten : 48 3.37/3.59 # Generated clauses : 169267 3.37/3.59 # ...of the previous two non-trivial : 156860 3.37/3.59 # Contextual simplify-reflections : 190 3.37/3.59 # Paramodulations : 162534 3.37/3.59 # Factorizations : 12 3.37/3.59 # NegExts : 0 3.37/3.59 # Equation resolutions : 6457 3.37/3.59 # Propositional unsat checks : 0 3.37/3.59 # Propositional check models : 0 3.37/3.59 # Propositional check unsatisfiable : 0 3.37/3.59 # Propositional clauses : 0 3.37/3.59 # Propositional clauses after purity: 0 3.37/3.59 # Propositional unsat core size : 0 3.37/3.59 # Propositional preprocessing time : 0.000 3.37/3.59 # Propositional encoding time : 0.000 3.37/3.59 # Propositional solver time : 0.000 3.37/3.59 # Success case prop preproc time : 0.000 3.37/3.59 # Success case prop encoding time : 0.000 3.37/3.59 # Success case prop solver time : 0.000 3.37/3.59 # Current number of processed clauses : 3387 3.37/3.59 # Positive orientable unit clauses : 157 3.37/3.59 # Positive unorientable unit clauses: 0 3.37/3.59 # Negative unit clauses : 360 3.37/3.59 # Non-unit-clauses : 2870 3.37/3.59 # Current number of unprocessed clauses: 147125 3.37/3.59 # ...number of literals in the above : 590099 3.37/3.59 # Current number of archived formulas : 0 3.37/3.59 # Current number of archived clauses : 176 3.37/3.59 # Clause-clause subsumption calls (NU) : 1107328 3.37/3.59 # Rec. Clause-clause subsumption calls : 734332 3.37/3.59 # Non-unit clause-clause subsumptions : 3173 3.37/3.59 # Unit Clause-clause subsumption calls : 57675 3.37/3.59 # Rewrite failures with RHS unbound : 0 3.37/3.59 # BW rewrite match attempts : 146 3.37/3.59 # BW rewrite match successes : 16 3.37/3.59 # Condensation attempts : 0 3.37/3.59 # Condensation successes : 0 3.37/3.59 # Termbank termtop insertions : 2196559 3.37/3.60 3.37/3.60 # ------------------------------------------------- 3.37/3.60 # User time : 3.111 s 3.37/3.60 # System time : 0.101 s 3.37/3.60 # Total time : 3.212 s 3.37/3.60 # Maximum resident set size: 2568 pages 3.37/3.60 EOF